The Three-state Perfect Phylogeny Problem Reduces to 2-SAT
نویسندگان
چکیده
منابع مشابه
The Three-State Perfect Phylogeny Problem Reduces to 2-SAT
We extend a structural result by A. Dress and M. Steel [3], to show that the three-state Perfect Phylogeny problem reduces in polynomial time to the classic 2-SAT problem. We also give a more expanded exposition of the proof of the structural result from [3]. We hope this note will encourage additional researchers to try to solve the central open question: finding simple efficient solutions to ...
متن کاملThe Incomplete Perfect Phylogeny Haplotype Problem
The problem of resolving genotypes into haplotypes, under the perfect phylogeny model, has been under intensive study recently. All studies so far handled missing data entries in a heuristic manner. We prove that the perfect phylogeny haplotype problem is NP-complete when some of the data entries are missing, even when the phylogeny is rooted. We define a biologically motivated probabilistic mo...
متن کاملGeneralizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters
We study the three state perfect phylogeny problem and establish a generalization of the four gamete condition (also called the Splits Equivalence Theorem) for sequences over three state characters. Our main result is that a set of input sequences over three state characters allows a perfect phylogeny if and only if every subset of three characters allows a perfect phylogeny. In establishing th...
متن کاملReducing SAT to 2-SAT
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
متن کاملIncomplete Directed Perfect Phylogeny
Perfect phylogeny is one of the fundamental models for studying evolution. We investigate the following variant of the problem: The input is an n ×m species-characters matrix. The characters are binary and directed, i.e., a species can only gain characters. The difference from standard perfect phylogeny is that for some species the state of some characters is unknown. The question is whether on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Information and Systems
سال: 2009
ISSN: 1526-7555,2163-4548
DOI: 10.4310/cis.2009.v9.n4.a1